Algorithms

Saturday, February 16, 2013

Same Trees


Same TreeSep 3 '12
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value

Posted by Unknown at 5:25 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ►  2014 (21)
    • ►  March (3)
    • ►  February (6)
    • ►  January (12)
  • ▼  2013 (107)
    • ►  December (19)
    • ►  November (18)
    • ►  October (5)
    • ►  April (11)
    • ►  March (29)
    • ▼  February (25)
      • Length of Last Word
      • Valid Palindrome
      • Remove Duplicates from Sorted Array
      • Swap Nodes in Pairs
      • Balanced Binary Tree
      • Two Sum
      • Remove Element
      • Jump Game
      • Remove Nth Node From End of List
      • Valid Parentheses
      • Convert Sorted Array to Binary Search Tree
      • Path Sum II
      • Binary Tree Inorder Traversal
      • Path Sum
      • Populating Next Right Pointers in Each Node II
      • Populating Next Right Pointers in Each Node
      • Flatten Binary Tree to Linked List
      • Sum Root to Leaf Numbers
      • Reverse Between m and n
      • Symmetric Tree
      • Level Order Traversal
      • Minimum Depth of a Binary Tree
      • Maximum Depth of a Binary Tree
      • Same Trees
      • Validate BST

About Me

Unknown
View my complete profile
Simple theme. Powered by Blogger.