Know Thyself
  • Blogs
  • Outlines
    Algorithms Projects Coding Reading Essays
  • About Me
  • Search

Understanding


This is where I write down drafts for learning

129. Sum Root to Leaf Numbers

Posted on November 6, 2019

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. [Read More]
Tags: Coding LeetCode

124. Binary Tree Maximum Path Sum

Hard

Posted on November 6, 2019

Given a non-empty binary tree, find the maximum path sum. [Read More]
Tags: Coding LeetCode Tree Hard

117. Populating Next Right Pointers in Each Node II

Medium

Posted on November 6, 2019

Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. [Read More]
Tags: Coding LeetCode Medium BFS

116. Populating Next Right Pointers in Each Node

Medium

Posted on November 5, 2019

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: [Read More]
Tags: Coding LeetCode DFS BFS Medium

114. Flatten Binary Tree to Linked List

Medium

Posted on November 5, 2019

Given a binary tree, flatten it to a linked list in-place. [Read More]
Tags: Coding LeetCode DFS Medium

106. Construct Binary Tree from Inorder and Postorder Traversal

Medium

Posted on October 31, 2019

Description [Read More]
Tags: Coding LeetCode Medium DFS Tree
  • ← Newer Posts
  • Older Posts →
  • RSS
  • Email me
  • Facebook
  • GitHub
  • Twitter

gitlinux  •  2022

Total views.