all-elements-in-two-binary-search-trees

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two binary search trees <code>root1</code> and <code>root2</code>, return a list containing all the integers from both trees sorted in ascending order.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/12/18/q2-e1.png" style="width: 457px; height: 207px;" />
<pre>
Input: root1 = [2,1,4], root2 = [1,0,3]
Output: [0,1,1,2,3,4]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2019/12/18/q2-e5-.png" style="width: 352px; height: 197px;" />
<pre>
Input: root1 = [1,null,8], root2 = [8,1]
Output: [1,1,8,8]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in each tree is in the range <code>[0, 5000]</code>.</li>
	<li><code>-105 &lt;= Node.val &lt;= 105</code></li>
</ul>

getAllElements

All Elements in Two Binary Search Trees

Tree

Depth-First Search

Binary Search Tree

Binary Tree

Sorting

给你&nbsp;<code>root1</code> 和 <code>root2</code>&nbsp;这两棵二叉搜索树。请你返回一个列表，其中包含&nbsp;两棵树&nbsp;中的所有整数并按 升序 排序。.

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/12/29/q2-e1.png" />

<pre>
输入：root1 = [2,1,4], root2 = [1,0,3]
输出：[0,1,1,2,3,4]
</pre>

示例 2：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/12/29/q2-e5-.png" />

<pre>
输入：root1 = [1,null,8], root2 = [8,1]
输出：[1,1,8,8]
</pre>

&nbsp;

提示：

<ul>
	<li>每棵树的节点数在&nbsp;<code>[0, 5000]</code> 范围内</li>
	<li><code>-105&nbsp;&lt;= Node.val &lt;= 105</code></li>
</ul>