Posts

Showing posts with the label big-O
Show All

recursive function called trimTree, which removes (deletes) all the nodes at depth d or more in a BST.

Post a Comment

Write code to PRINT all items of ARRAY BASED REPRESENTATION of a binary tree using NON-RECURSIVE pre-order traversal

Post a Comment
Image

Write a recursive function PrintPath, to print the path of a node to the root in a binary tree

Post a Comment

Find the time complexity function and big-O for the following code segments.

Post a Comment