Home » Tags » traversal

Traversal/Preorder

Given preorder traversal of a BST, check if each non-leaf node has only one child

Number of elements smaller than root in preorder traversal of a BST

Verify Preorder Serialization of a Binary Tree

Locking and unlocking resources represented as binary tree nodes

Construct Binary Tree from Inorder and Preorder Traversal

Sum of Distances in Tree

Leaf-Similar Trees Problem

Convert Sorted Array to height-balanced Binary Search Tree

Maximum Depth of Binary Tree

Flatten Binary Tree to Linked List in Order of Preorder Traversal

This site uses cookies to improve your experience on our website. By using and continuing to navigate this website, you accept this. Privacy Policy