Increasing Order Search Tree

Title: Increasing Order Search Tree Source: leetcode.com

Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child (Increasing order search tree).

Example 1:

Note:

  1. The number of nodes in the given tree will be between 1 and 100.
  2. Each node will have a unique integer value from 0 to 1000.

Python solution

Increasing Order Search Tree
Rate this post

Leave a Reply